Revisiting strong Gröbner bases over Euclidean domains
نویسنده
چکیده
Buchberger and Kandri−Rody and Kapur defined a strong Gröbner basis for a polynomial ideal over a Euclidean domain in a way that gives rise to canonical reductions. This retains what is perhaps the most important property of Gröbner bases over fields. A difficulty is that these can be substantially harder to compute than their field counterparts. We extend their results for computing these bases to give an algorithm that is effective in practice. In particular we show how to use S− polynomials (rather than "critical pairs") so that the algorithm becomes quite similar to that for fields, and thus known strategies for the latter may be employed. We also show how Buchberger’s important criteria for detection of unneeded S−polynomials can be extended to work over a Euclidean domain. We then provide simple examples as well as applications to solving equations in quotient rings, Hensel lifting, Hermite normal form computations, and reduction of univariate polynomial lattices. These serve to demonstrate why Gröbner basis computations over such rings are indeed worthy of consideration.
منابع مشابه
Primary Decomposition of Modules over Dedekind Domains Using Gröbner Bases
In [6] was proved that if R is a principal ideal domain and N ⊂ M are submodules of R[x1, . . . , xn], then the primary decomposition for N in M can be computed using Gröbner bases. In this paper we extend this result to Dedekind domains. The procedure that computed the primary decomposition is illustrated with an example.
متن کاملAutomated Proving in Geometry using Gröbner Bases in Isabelle/HOL
For several decades, algebraic method have been successfully used in automated deduction in geometry. Objects in Euclidean geometry and relations between them are expressed as polynomials, and algebraic methods (e.g., Gröbner bases) are used over that set of polynomials. We describe a formalization of an algorithm in Isabelle/HOL that accepts a term representation of a geometry construction and...
متن کاملGROEBNER: A Package for Calculating Gröbner Bases, Version 3.0
Gröbner bases are a valuable tool for solving problems in connection with multivariate polynomials, such as solving systems of algebraic equations and analyzing polynomial ideals. For a definition of Gröbner bases, a survey of possible applications and further references, see [6]. Examples are given in [5], in [7] and also in the test file for this package. The Groebner package calculates Gröbn...
متن کامل